Parallel Heuristic Search

نویسندگان

  • Tito Autrey
  • Herbert Gelernter
چکیده

SYNCHEM is a large expert system in the domain of organic chemistry. It finds synthetic pathways by chaining backwards from the target molecule to available compounds. SYNCHEM uses heuristic search to explore the solution space efficiently. Depending on the complexity of the target compound, the system currently takes from a few hours to several days.to solve an interesting problem using the present knowledge base. A production sized knowledge base would increase the search time by an order or magnitude or more. This is an unacceptable response time if SYNCHEM is to become a practical tool for organic chemists. Many organic chemists now have access to powerful workstations for tasks such as molecular modeling, information retrieval and data analysis. Some of these are shared memory multi-processor (SMP) machines. When groups of workstations are networked together they can be viewed as a distributed memory (DM) machine. Since the inter-process communication costs are different for SMP and DM machines, they require different approaches to harnessing all of their computational power. Users of SYNCHEM are interested in speedy results and in quality results. It is necessary to enhance the search strategy algorithms to take into account the architecture-dependent communication costs. These algorithms should be scalable to large numbers of processors, and should be able to make dynamic tradeofi~ between quality of search and time to solution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

AN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES

Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...

متن کامل

حل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه

The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...

متن کامل

A parallel iterated tabu search heuristic for vehicle routing problems

This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems: the classical vehicle routing problem (VRP), the periodic VRP, the multi-depot VRP, and the site-dependent VRP. In addition, it is applicable to the time-window constrained variant of these problems. Using the iterated local search framework, the heuristic combines tabu search with a sim...

متن کامل

Parallel heuristic search in Haskell

Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming languag...

متن کامل

A Local Search Heuristic for Unrelated Parallel Machine Scheduling with Efficient Neighborhood Search

The parallel mechine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the “efficiency” of the machinea for each job. It is shown that this method yields better solutions and shorter running times than the more general local search...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002